Semantic construction with graph grammars
نویسنده
چکیده
We introduce s-graph grammars, a new grammar formalism for computing graph-based semantic representations. Semantically annotated corpora which use graphs as semantic representations have recently become available, and there have been a number of data-driven systems for semantic parsing that can be trained on these corpora. However, it is hard to map the linguistic assumptions of these systems onto more classical insights on semantic construction. S-graph grammars use graphs as semantic representations, in a way that is consistent with more classical views on semantic construction. We illustrate this with a number of hand-written toy grammars, sketch the use of s-graph grammars for data-driven semantic parsing, and discuss formal aspects.
منابع مشابه
Graph parsing with s-graph grammars
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. computing all possible analyses of a given graph according to a grammar. This problem arises in training synchronous string-to-graph grammars, and when generating strings from them. We present two algorithms for graph parsing (bottom-up and top-down) with s-graph grammars. On the related problem o...
متن کاملConstraint-based RMRS Construction from Shallow Grammars
Semantic formalisms such as MRS [Copestake et al., 2003], UDRT [Reyle, 1993], or CLLS [Egg et al., 2001] provide elegant solutions for the treatment of semantic ambiguities in terms of underspecification. These semantic formalisms are not constrained to specific syntactic frameworks. MRS, for example, is mainly used with HPSG grammars, but may also be built from LFG grammars using co-descriptio...
متن کاملUnfolding of Double-pushout Graph Grammars Is a Coreeection ?
In a recent paper, mimicking Winskel's construction for Petri nets, a concurrent semantics for (double-pushout) DPO graph grammars has been provided by showing that each graph grammar can be unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar. This paper faces the problem of p...
متن کاملDPO rewriting and abstract semantics via opfibrations
The classical DPO graph rewriting construction is re-expressed using the oppbration approach introduced originally for term graph rewriting. Using a skeleton category of graphs, a base of canonical graphs-in-context, with DPO rules as arrows, and with categories of redexes over each object in the base, yields a category of rewrites via the discrete Grothendieck construction. The various possibl...
متن کاملUnfolding of Double-Pushout Graph Grammars is a Coreflection
In a recent paper, mimicking Winskel’s construction for Petri nets, a concurrent semantics for (double-pushout) DPO graph grammars has been provided by showing that each graph grammar can be unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar. This paper faces the problem of p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015